Natural Color Categories Are Convex Sets
نویسنده
چکیده
The paper presents a statistical evaluation of the typological data about color naming systems across the languages of the world that have been obtained by the World Color Survey. In a first step, we discuss a principal component analysis of the categorization data that led to a small set of easily interpretable features that are dominant in color categorization. These features were used for a dimensionality reduction of the categorization data. Using the thus preprocessed categorization data, we proceed to show that the available typological data support the hypothesis by the cognitive scientist Peter Gärdenfors that the extension of color category are convex sets in the CIELab space in all languages of the world.
منابع مشابه
A convex combinatorial property of compact sets in the plane and its roots in lattice theory
K. Adaricheva and M. Bolat have recently proved that if $,mathcal U_0$ and $,mathcal U_1$ are circles in a triangle with vertices $A_0,A_1,A_2$, then there exist $jin {0,1,2}$ and $kin{0,1}$ such that $,mathcal U_{1-k}$ is included in the convex hull of $,mathcal U_kcup({A_0,A_1, A_2}setminus{A_j})$. One could say disks instead of circles.Here we prove the existence of such a $j$ and $k$ ...
متن کاملComplexity of Finding Nearest Colorful Polytopes
Let P1, . . . , Pd+1 ⊂ R be point sets whose convex hulls each contain the origin. Each set represents a color class. The Colorful Carathéodory theorem guarantees the existence of a colorful choice, i.e., a set that contains exactly one point from each color class, whose convex hull also contains the origin. The computational complexity of finding such a colorful choice is still unknown. We stu...
متن کاملConvex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions
We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...
متن کاملSet Theoretic Estimation for Problems in Subtractive Color
The use of linear algebra and set theoretic estimation for problems in color science and imaging is reviewed. Through a product-space formalism, the powerful projections onto convex sets (POCS) algorithm is extended to subtractive color systems satisfying convex constraints in the density domain. Several convex sets are defined, which are useful in color science and imaging, and projections ont...
متن کاملComputational Aspects of the Colorful Carathéodory Theorem
Let P1, . . . , Pd+1 ⊂ R be d-dimensional point sets such that the convex hull of each Pi contains the origin. We call the sets Pi color classes, and we think of the points in Pi as having color i. A colorful choice is a set with at most one point of each color. The colorful Carathéodory theorem guarantees the existence of a colorful choice whose convex hull contains the origin. So far, the com...
متن کامل